Pure Compiled Execution as a Programming Paradigm
نویسندگان
چکیده
منابع مشابه
A Decoupled Execution Paradigm Programming Model
Programming models bridge the gap between the underlying hardware architecture and the supporting layers of software available to applications. Specifically, a programming model is an abstraction of the underlying computer system that allows for the expression of both algorithms and data structures and exists independently of the choice of both the programming language and the supporting APIs. ...
متن کاملAdaptive Execution of Compiled Queries
Compiling queries to machine code is a very efficient way for executing queries. One often overlooked problem with compilation is the time it takes to generate machine code. Even with fast compilation frameworks like LLVM, generating machine code for complex queries often takes hundreds of milliseconds. Such durations can be a major disadvantage for workloads that execute many complex, but quic...
متن کاملAttribute grammars as a functional programming paradigm
The purpose of this paper is twofold. Firstly we show how attributes in an attribute grammar can be simply and efficiently evaluated using a lazy functional language. The class of attribute grammars we can deal with are the most general ones possible: attributes may depend on each other in an arbitrary way, as long as there are no truly circular data dependencies. Secondly, we describe a method...
متن کاملSpying as an Object-Oriented Programming Paradigm
We introduce spying, a novel way of programming with objects, based on capsule programming and reflective facilities. This programming style allows easy building of monitoring systems, such as tracers, debuggers. We point out three main problems related to this programming style, and propose practical solutions to some of them. We exemplify our claims with a system that performs master/slave co...
متن کاملSwift: Compiled Inference for Probabilistic Programming Languages
A probabilistic program defines a probability measure over its semantic structures. One common goal of probabilistic programming languages (PPLs) is to compute posterior probabilities for arbitrary models and queries, given observed evidence, using a generic inference engine. Most PPL inference engines—even the compiled ones—incur significant runtime interpretation overhead, especially for cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of the RAS
سال: 2018
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2018-30(2)-1